Perspectives and open problems in geometric analysis: spectrum of Laplacian
نویسنده
چکیده
1. Basic gradient estimate; different variations of the gradient estimates; 2. The theorem of Brascamp-Lieb, Barkey-Émery Riemannian geometry, relation of eigenvalue gap with respect to the first Neumann eigenvalue; the Friedlander-Solomayak theorem, 3. The definition of the Laplacian on L space, theorem of Sturm, 4. Theorem of Wang and its possible generalizations. 1 Gradient estimate of the first eigenvalue Let M be an n-dimensional Riemannian manifold with or without boundary. Let the metric ds be represented by ds = ∑ gijdxidxj , where (x1, · · · , xn) are local coordinates. Let ∆ = 1 √ g ∑ ∂ ∂xi (g √ g ∂ ∂xj ) be the Laplace operator, where (g) = g−1 ij , g = det(gij). The operator ∆ acts on smooth functions. If ∂M 6= ∅, then we may define one of the following two boundary conditions: ¬. Dirichlet condition: f |∂M = 0. . Neumann condition: ∂f ∂n |∂M = 0, where n is the outward normal vector of the manifold ∂M .
منابع مشابه
Evolution of the first eigenvalue of buckling problem on Riemannian manifold under Ricci flow
Among the eigenvalue problems of the Laplacian, the biharmonic operator eigenvalue problems are interesting projects because these problems root in physics and geometric analysis. The buckling problem is one of the most important problems in physics, and many studies have been done by the researchers about the solution and the estimate of its eigenvalue. In this paper, first, we obtain the evol...
متن کاملLaplacian Energy of a Fuzzy Graph
A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...
متن کاملNormalized laplacian spectrum of two new types of join graphs
Let $G$ be a graph without an isolated vertex, the normalized Laplacian matrix $tilde{mathcal{L}}(G)$ is defined as $tilde{mathcal{L}}(G)=mathcal{D}^{-frac{1}{2}}mathcal{L}(G)mathcal{D}^{-frac{1}{2}}$, where $mathcal{D}$ is a diagonal matrix whose entries are degree of vertices of $G$. The eigenvalues of $tilde{mathcal{L}}(G)$ are called as the normalized Laplacian eigenva...
متن کاملOptimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling
This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...
متن کاملSome Perspectives of Machine Repair Problems
In this article, we survey machine repair problems (MRP) with an emphasis on historical developments of queuing models of practical importance. The survey proceeds historically, starting with developments in 1985, when the first published review on machine interference models appeared. We attempt to elaborate some basic MRP models of the real life congestion situations. The brief survey of some...
متن کامل